Threshold circuits of bounded depth

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bounded Arithmetic Theory for Constant Depth Threshold Circuits

We deene an extension R 0 2 of the bounded arithmetic theory R 0 2 and show that the class of functions b 1-deenable in R 0 2 coincides with the computational complexity class TC 0 of functions computable by polynomial size, constant depth threshold circuits.

متن کامل

Communication in Bounded Depth Circuits

We show that rigidity of matrices can be used to prove lower bounds on depth 2 circuits and communication graphs. We prove a general nonlinear lower bound on a certain type of circuits and thus, in particular, we determine the asymptotic size of depth d superconcentrators for all depths 4 (for even depths 4 it has been determined before).

متن کامل

On Small Depth Threshold Circuits

In this talk we will consider various classes defined by small depth polynomial size circuits which contain threshold gates and parity gates. We will describe various inclusions between many classes defined in this way and also classes whose definitions rely upon spectral properties of Boolean functions.

متن کامل

Energy Complexity and Depth of Threshold Circuits

In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they have completely different physical meanings. Suppose that a Boolean function f can be computed by a threshold circuit C of energy complexity e and hence at most e threshold gates in C output “1” for any input to C. We then prove t...

متن کامل

Threshold Circuits of Small Majority-Depth

Constant-depth polynomial-size threshold circuits are usually classi ed according to their total depth. For example, the best known threshold circuits for iterated multiplication and division have depth four and three, respectively. In this paper, the complexity of threshold circuits is investigated from a di erent point of view: explicit AND, OR gates are allowed in the circuits, and a thresho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1993

ISSN: 0022-0000

DOI: 10.1016/0022-0000(93)90001-d